On Morphisms Preserving Primitive Words
نویسنده
چکیده
A word is called primitive if it cannot be expressed as the power of another word. Morphisms preserving primitive words are investigated. Similarly to the word case, each square-free morphism is a primitive morphism but the converse does not hold. A precise characterization of primitive morphisms is provided in terms of pure codes. An easily testable characterization is given for uniform morphisms over the binary alphabet. TUCS Research Group Mathematical Structures of Computer Science
منابع مشابه
The equality problem for infinite words generated by primitive morphisms
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
متن کاملMatrices of 3-iet preserving morphisms
We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid {M ∈ N | det M = ±1} = {M ∈ N | MEM = ±E}, where E = ( 0 1 −1 0 ). We prove that in case of exchange of t...
متن کاملA note on 3iet preserving morphisms
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A morphism is said to be 3iet preserving if it maps any 3iet word to another 3iet word. It is known that the monoid of morphisms preserving sturmian words is finitely...
متن کاملMorphically Primitive Words (extended Abstract) *
In the present paper, we introduce an alternative notion of the primitivity of words, that – unlike the standard understanding of this term – is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet Σ, we call a word w ∈ Σ∗ morphically imprimitive provided that there are a shorter word v and morphisms h, h′ : Σ∗ → Σ∗ satisfying h(v) = w and h′(w) = ...
متن کاملLoughborough University Institutional Repository
In the present paper, we introduce an alternative notion of the primitivity of words, that – unlike the standard understanding of this term – is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet Σ, we call a word w ∈ Σ∗ morphically imprimitive provided that there are a shorter word v and morphisms h, h′ : Σ∗ → Σ∗ satisfying h(v) = w and h′(w) = ...
متن کامل